Performance Evaluations and Efficient Sorting
نویسندگان
چکیده
Much of the production in firms takes place over time. This paper seeks to understand the value of interim performance information on long projects. In particular, the model explores the sorting effects of performance evaluations. Conducting an interim performance evaluation increases efficiency by providing the option to end projects with low early returns. The main result: It is efficient to allocate more resources towards the end of a project. This result holds under a variety of scenarios: when the worker has unknown ability, when the outside options vary with output, and even under an agency framework with a risk-averse agent.
منابع مشابه
cuHE: A Homomorphic Encryption Accelerator Library
We introduce a CUDA GPU library to accelerate evaluations with homomorphic schemes defined over polynomial rings enabled with a number of optimizations including algebraic techniques for efficient evaluation, memory minimization techniques, memory and thread scheduling and low level CUDA hand-tuned assembly optimizations to take full advantage of the mass parallelism and high memory bandwidth G...
متن کاملA Near-ML Complex K-Best Decoder with Efficient Search Design for MIMO Systems
A low-complexity near-ML K-Best sphere decoder is proposed. The development of the proposed K-Best sphere decoding algorithm (SDA) involves two stages. First, a new candidate sequence generator (CSG) is proposed. The CSG directly operates in the complex plane and efficiently generates sorted candidate sequences with precise path weights. Using the CSG and an associated parallel comparator, the ...
متن کاملAn Adapted Non-dominated Sorting Algorithm (ANSA) for Solving Multi Objective Trip Distribution Problem
Trip distribution deals with estimation of trips distributed among origins and destinations and is one of the important stages in transportation planning. Since in the real world, trip distribution models often have more than one objective, multi-objective models are developed to cope with a set of conflict goals in this area. In a proposed method of adapted non-dominated sorting algorithm (ANS...
متن کاملFast Kernel Methods for SVM Sequence Classifiers
In this work we study string kernel methods for sequence analysis and focus on the problem of species-level identification based on short DNA fragments known as barcodes. We introduce efficient sorting-based algorithms for exact string k-mer kernels and then describe a divide-and-conquer technique for kernels with mismatches. Our algorithm for the mismatch kernel matrix computation improves cur...
متن کاملAn Efficient Multiway Mergesort for GPU Architectures
Sorting is a primitive operation that is a building block for countless algorithms. As such, it is important to design sorting algorithms that approach peak performance on a range of hardware architectures. Graphics Processing Units (GPUs) are particularly attractive architectures as they provides massive parallelism and computing power. However, the intricacies of their compute and memory hier...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007